Realizing Arithmetic Operations in Rings ZZ
نویسندگان
چکیده
The constant depth threshold circuit complexity of iterated addition, multiplication, and iterated multiplication in rings Z Z], where is an algebraic integer, is studied. It is shown that iterated addition is 1{approximable, multiplication is 2{approximable, and iterated multiplication is 3{approximable.
منابع مشابه
Reducing Ideal Arithmetic to Linear Algebra Problems
In this paper, we will show a reduction of ideal arithmetic, or more generally, of arithmetic of ZZ{modules of full rank in orders of number elds to problems of linear algebra over ZZ=mZZ, where m is a possibly composite integer. The problems of linear algebra over ZZ=mZZ will be solved directly, instead of either \reducing" them to problems of linear algebra over ZZ or factoring m and working ...
متن کاملArithmetic Deformation Theory of Lie Algebras
This paper is devoted to deformation theory of graded Lie algebras over Z or Zl with finite dimensional graded pieces. Such deformation problems naturally appear in number theory. In the first part of the paper, we use Schlessinger criteria for functors on Artinian local rings in order to obtain universal deformation rings for deformations of graded Lie algebras and their graded representations...
متن کاملPrediction of Sulfate Scale Depositions in Oilfield Operations Using Arithmetic of LR Fuzzy Numbers
In this study fuzzy arithmetic is presented as a tool to tackle the prediction of the amount of barium, strontium and calcium sulfates scales in oilfield operations. Since the shape of fuzzy numbers’ membership functions is a spread representative of the whole possible values for a special model parameter, fuzzy numbers are able to consider the uncertainties in parameter determinations and thus...
متن کاملMultiplication in Cyclotomic Rings and its Application to Finite Fields
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in cyclotomic rings and cyclotomic fields in that most arithmetic operations are done on vectors. From this formulation we can generate optimized algorithms for m...
متن کاملAutomatic Verification of Recursive Procedures with One Integer Parameter
Context-free processes (BPA) have been used for dataflow-analysis in recursive procedures with applications in optimizing compilers [6]. We introduce a more refined model called BPA(ZZ) that can model not only recursive dependencies, but also the passing of integer parameters to subroutines. Moreover, these parameters can be tested against conditions expressible in Presburger-arithmetic. This n...
متن کامل